________________________________________________________________

Run Header: Complete YList Version try 5: /small pw steps

Run start:        31.01.2010 10:24:47
Input Data from:  dataset120.txt
Iteration limit:  500
NI iter. limit:   200

# of Customers  :200
# of Locations  :10
Ex.Facilities   :3
Total budget    :20000
Terror. attacks :1

Penalty Weight : 0,5
Update Policy  : 4-3 of last 10
pw inc. step   : 0,005

Coverage Ratio :0,2015
Average f[i]   :3850
Average g[i,j] :1947,61904761905
Total demand   :11310
________________________________________________________________

## ITERATION 0 #######################


> Neighbours evaluated; 10
> Selected Move:	4130	1	-1	3	4500


> New Y[]: 
	
	 2  3  4  1  0  0  0  0  0  0    >new incumb.: 4130


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 1 #######################


> Neighbours evaluated; 25
> Selected Move:	5410	1	-1	8	10500


> New Y[]: 
	
	 2  3  4  1  0  0  0  0  1  0    >new incumb.: 5410


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 2 #######################


> Neighbours evaluated; 16
> Selected Move:	6260	1	-1	4	17000


> New Y[]: 
	
	 2  3  4  1  1  0  0  0  1  0    >new incumb.: 6260


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 3 #######################


> Neighbours evaluated; 11
> Selected Move:	7020	3	1	7	18500


> New Y[]: 
	
	 2  0  4  1  1  0  0  3  1  0    >new incumb.: 7020


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 4 #######################


> Neighbours evaluated; 12
> Selected Move:	7270	3	0	6	20400


> New Y[]: 
	
	 0  0  4  1  1  0  2  3  1  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 5 #######################


> Neighbours evaluated; 10
> Selected Move:	7270	4	6	4	20400


> New Y[]: 
	
	 0  0  4  1  2  0  1  3  1  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 6 #######################


> Neighbours evaluated; 13
> Selected Move:	7120	4	4	7	20700


> New Y[]: 
	
	 0  0  4  1  3  0  1  2  1  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0 
 > pw :0,495

## ITERATION 7 #######################


> Neighbours evaluated; 8
> Selected Move:	7173	4	4	6	20600


> New Y[]: 
	
	 0  0  4  1  1  0  3  2  1  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0 
 > pw :0,49

## ITERATION 8 #######################


> Neighbours evaluated; 13
> Selected Move:	7090	3	4	9	18600


> New Y[]: 
	
	 0  0  4  1  0  0  3  2  1  1    >new incumb.: 7090


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0 
 > pw :0,485

## ITERATION 9 #######################


> Neighbours evaluated; 20
> Selected Move:	7096	3	2	5	20400


> New Y[]: 
	
	 0  0  0  1  0  4  3  2  1  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0 
 > pw :0,49

## ITERATION 10 #######################


> Neighbours evaluated; 6
> Selected Move:	7290	4	5	3	19900


> New Y[]: 
	
	 0  0  0  4  0  1  3  2  1  1    >new incumb.: 7290


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0 
 > pw :0,495

## ITERATION 11 #######################


> Neighbours evaluated; 8
> Selected Move:	7290	4	3	6	20000


> New Y[]: 
	
	 0  0  0  3  0  1  4  2  1  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 12 #######################


> Neighbours evaluated; 8
> Selected Move:	7290	4	3	7	20000


> New Y[]: 
	
	 0  0  0  2  0  1  4  3  1  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0 
 > pw :0,505

## ITERATION 13 #######################


> Neighbours evaluated; 8
> Selected Move:	7290	4	3	6	19700


> New Y[]: 
	
	 0  0  0  4  0  1  2  3  1  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0 
 > pw :0,51

## ITERATION 14 #######################


> Neighbours evaluated; 6
> Selected Move:	7290	4	3	8	17900


> New Y[]: 
	
	 0  0  0  1  0  1  2  3  4  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0 
 > pw :0,505

## ITERATION 15 #######################


> Neighbours evaluated; 14
> Selected Move:	7378	3	5	4	20400


> New Y[]: 
	
	 0  0  0  1  1  0  2  3  4  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1 
 > pw :0,5

## ITERATION 16 #######################


> Neighbours evaluated; 5
> Selected Move:	7380	4	6	4	20400


> New Y[]: 
	
	 0  0  0  1  2  0  1  3  4  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1 
 > pw :0,495

## ITERATION 17 #######################


> Neighbours evaluated; 5
> Selected Move:	7580	4	8	6	19900


> New Y[]: 
	
	 0  0  0  1  2  0  4  3  1  1    >new incumb.: 7580


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1 
 > pw :0,49

## ITERATION 18 #######################


> Neighbours evaluated; 5
> Selected Move:	7482	4	4	7	20200


> New Y[]: 
	
	 0  0  0  1  3  0  4  2  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1 
 > pw :0,485

## ITERATION 19 #######################


> Neighbours evaluated; 6
> Selected Move:	7386	4	4	8	20400


> New Y[]: 
	
	 0  0  0  1  1  0  4  2  3  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1 
 > pw :0,48

## ITERATION 20 #######################


> Neighbours evaluated; 9
> Selected Move:	7292	4	6	8	20600


> New Y[]: 
	
	 0  0  0  1  1  0  3  2  4  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1 
 > pw :0,485

## ITERATION 21 #######################


> Neighbours evaluated; 6
> Selected Move:	7290	3	4	5	18100


> New Y[]: 
	
	 0  0  0  1  0  1  3  2  4  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0 
 > pw :0,49

## ITERATION 22 #######################


> Neighbours evaluated; 10
> Selected Move:	7290	4	6	8	17900


> New Y[]: 
	
	 0  0  0  1  0  1  4  2  3  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0 
 > pw :0,495

## ITERATION 23 #######################


> Neighbours evaluated; 13
> Selected Move:	7290	4	6	7	18600


> New Y[]: 
	
	 0  0  0  1  0  1  2  4  3  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 24 #######################


> Neighbours evaluated; 10
> Selected Move:	7290	4	6	8	19200


> New Y[]: 
	
	 0  0  0  1  0  1  3  4  2  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0 
 > pw :0,505

## ITERATION 25 #######################


> Neighbours evaluated; 6
> Selected Move:	7290	4	6	7	18300


> New Y[]: 
	
	 0  0  0  1  0  1  4  3  2  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 26 #######################


> Neighbours evaluated; 8
> Selected Move:	7290	4	8	9	19300


> New Y[]: 
	
	 0  0  0  1  0  1  4  3  1  2 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0 
 > pw :0,495

## ITERATION 27 #######################


> Neighbours evaluated; 15
> Selected Move:	7290	4	6	8	19800


> New Y[]: 
	
	 0  0  0  1  0  1  1  3  4  2 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0 
 > pw :0,49

## ITERATION 28 #######################


> Neighbours evaluated; 12
> Selected Move:	7192	4	7	6	20200


> New Y[]: 
	
	 0  0  0  1  0  1  3  1  4  2 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0 
 > pw :0,485

## ITERATION 29 #######################


> Neighbours evaluated; 7
> Selected Move:	7290	4	6	8	20000


> New Y[]: 
	
	 0  0  0  1  0  1  4  1  3  2 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0 
 > pw :0,48

## ITERATION 30 #######################


> Neighbours evaluated; 8
> Selected Move:	7242	4	6	9	20100


> New Y[]: 
	
	 0  0  0  1  0  1  2  1  3  4 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0 
 > pw :0,475

## ITERATION 31 #######################


> Neighbours evaluated; 8
> Selected Move:	7290	4	6	7	19900


> New Y[]: 
	
	 0  0  0  1  0  1  1  2  3  4 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0 
 > pw :0,47

## ITERATION 32 #######################


> Neighbours evaluated; 11
> Selected Move:	7290	4	8	6	19600


> New Y[]: 
	
	 0  0  0  1  0  1  3  2  1  4 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0 
 > pw :0,465

## ITERATION 33 #######################


> Neighbours evaluated; 8
> Selected Move:	7290	4	6	7	19400


> New Y[]: 
	
	 0  0  0  1  0  1  2  3  1  4 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0 
 > pw :0,46

## ITERATION 34 #######################


> Neighbours evaluated; 8
> Selected Move:	7198	4	9	5	20200


> New Y[]: 
	
	 0  0  0  1  0  4  2  3  1  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0 
 > pw :0,455

## ITERATION 35 #######################


> Neighbours evaluated; 4
> Selected Move:	7199	4	5	6	20200


> New Y[]: 
	
	 0  0  0  1  0  2  4  3  1  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0 
 > pw :0,45

## ITERATION 36 #######################


> Neighbours evaluated; 11
> Selected Move:	6975	4	5	7	20700


> New Y[]: 
	
	 0  0  0  1  0  3  4  2  1  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0 
 > pw :0,455

## ITERATION 37 #######################


> Neighbours evaluated; 4
> Selected Move:	7290	4	5	9	19800


> New Y[]: 
	
	 0  0  0  1  0  1  4  2  1  3 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0 
 > pw :0,46

## ITERATION 38 #######################


> Neighbours evaluated; 11
> Selected Move:	7152	4	6	8	20300


> New Y[]: 
	
	 0  0  0  1  0  1  1  2  4  3 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0 
 > pw :0,465

## ITERATION 39 #######################


> Neighbours evaluated; 8
> Selected Move:	7058	4	7	6	20500


> New Y[]: 
	
	 0  0  0  1  0  1  2  1  4  3 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0 
 > pw :0,47

## ITERATION 40 #######################


> Neighbours evaluated; 10
> Selected Move:	7055	4	8	7	20500


> New Y[]: 
	
	 0  0  0  1  0  1  2  4  1  3 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0 
 > pw :0,475

## ITERATION 41 #######################


> Neighbours evaluated; 7
> Selected Move:	7195	4	6	9	20200


> New Y[]: 
	
	 0  0  0  1  0  1  3  4  1  2 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0 
 > pw :0,48

## ITERATION 42 #######################


> Neighbours evaluated; 6
> Selected Move:	7050	4	6	8	20500


> New Y[]: 
	
	 0  0  0  1  0  1  1  4  3  2 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0 
 > pw :0,485

## ITERATION 43 #######################


> Neighbours evaluated; 14
> Selected Move:	6708	4	9	3	21200


> New Y[]: 
	
	 0  0  0  2  0  1  1  4  3  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0 
 > pw :0,49

## ITERATION 44 #######################


> Neighbours evaluated; 7
> Selected Move:	7192	4	3	7	20200


> New Y[]: 
	
	 0  0  0  4  0  1  1  2  3  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0 
 > pw :0,495

## ITERATION 45 #######################


> Neighbours evaluated; 7
> Selected Move:	7092	4	7	6	20400


> New Y[]: 
	
	 0  0  0  4  0  1  2  1  3  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 46 #######################


> Neighbours evaluated; 11
> Selected Move:	6940	4	3	6	20700


> New Y[]: 
	
	 0  0  0  2  0  1  4  1  3  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0 
 > pw :0,505

## ITERATION 47 #######################


> Neighbours evaluated; 9
> Selected Move:	7030	3	3	4	20100


> New Y[]: 
	
	 0  0  0  0  2  1  4  1  3  1 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0 
 > pw :0,51

## ITERATION 48 #######################


> Neighbours evaluated; 6
> Selected Move:	7274	3	5	3	20600


> New Y[]: 
	
	 0  0  0  1  2  0  4  1  3  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1 
 > pw :0,515

## ITERATION 49 #######################


> Neighbours evaluated; 10
> Selected Move:	7168	4	6	8	20800


> New Y[]: 
	
	 0  0  0  1  2  0  3  1  4  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1 
 > pw :0,52

## ITERATION 50 #######################


> Neighbours evaluated; 7
> Selected Move:	7164	4	8	7	20800


> New Y[]: 
	
	 0  0  0  1  2  0  3  4  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1 
 > pw :0,525

## ITERATION 51 #######################


> Neighbours evaluated; 7
> Selected Move:	7108	4	4	6	20900


> New Y[]: 
	
	 0  0  0  1  3  0  2  4  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1 
 > pw :0,53

## ITERATION 52 #######################


> Neighbours evaluated; 6
> Selected Move:	7210	3	4	1	18900


> New Y[]: 
	
	 0  3  0  1  0  0  2  4  1  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0 
 > pw :0,535

## ITERATION 53 #######################


> Neighbours evaluated; 16
> Selected Move:	7210	4	6	7	18200


> New Y[]: 
	
	 0  3  0  1  0  0  4  2  1  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0 
 > pw :0,54

## ITERATION 54 #######################


> Neighbours evaluated; 15
> Selected Move:	7312	3	9	4	20200


> New Y[]: 
	
	 0  3  0  1  1  0  4  2  1  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0 
 > pw :0,545

## ITERATION 55 #######################


> Neighbours evaluated; 14
> Selected Move:	7202	4	7	4	20400


> New Y[]: 
	
	 0  3  0  1  2  0  4  1  1  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0 
 > pw :0,55

## ITERATION 56 #######################


> Neighbours evaluated; 15
> Selected Move:	7045	3	4	9	20300


> New Y[]: 
	
	 0  3  0  1  0  0  4  1  1  2 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0 
 > pw :0,555

## ITERATION 57 #######################


> Neighbours evaluated; 12
> Selected Move:	7210	4	9	8	19300


> New Y[]: 
	
	 0  3  0  1  0  0  4  1  2  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0 
 > pw :0,56

## ITERATION 58 #######################


> Neighbours evaluated; 12
> Selected Move:	7210	4	6	7	19800


> New Y[]: 
	
	 0  3  0  1  0  0  1  4  2  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0 
 > pw :0,565

## ITERATION 59 #######################


> Neighbours evaluated; 11
> Selected Move:	7210	4	7	8	18700


> New Y[]: 
	
	 0  3  0  1  0  0  1  2  4  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0 
 > pw :0,57

## ITERATION 60 #######################


> Neighbours evaluated; 12
> Selected Move:	7210	4	7	6	18900


> New Y[]: 
	
	 0  3  0  1  0  0  2  1  4  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0 
 > pw :0,565

## ITERATION 61 #######################


> Neighbours evaluated; 16
> Selected Move:	7071	3	1	4	20900


> New Y[]: 
	
	 0  0  0  1  3  0  2  1  4  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1 
 > pw :0,56

## ITERATION 62 #######################


> Neighbours evaluated; 6
> Selected Move:	7188	4	6	7	20700


> New Y[]: 
	
	 0  0  0  1  3  0  1  2  4  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1 
 > pw :0,565

## ITERATION 63 #######################


> Neighbours evaluated; 7
> Selected Move:	7100	3	7	0	19000


> New Y[]: 
	
	 2  0  0  1  3  0  1  0  4  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1 
 > pw :0,57

## ITERATION 64 #######################


> Neighbours evaluated; 6
> Selected Move:	7100	4	4	6	18900


> New Y[]: 
	
	 2  0  0  1  1  0  3  0  4  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1 
 > pw :0,565

## ITERATION 65 #######################


> Neighbours evaluated; 6
> Selected Move:	7100	4	6	8	18700


> New Y[]: 
	
	 2  0  0  1  1  0  4  0  3  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1 
 > pw :0,56

## ITERATION 66 #######################


> Neighbours evaluated; 6
> Selected Move:	7100	4	6	4	19700


> New Y[]: 
	
	 2  0  0  1  4  0  1  0  3  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1 
 > pw :0,555

## ITERATION 67 #######################


> Neighbours evaluated; 7
> Selected Move:	7100	4	8	6	19400


> New Y[]: 
	
	 2  0  0  1  4  0  3  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1 
 > pw :0,55

## ITERATION 68 #######################


> Neighbours evaluated; 6
> Selected Move:	7100	4	4	6	18500


> New Y[]: 
	
	 2  0  0  1  3  0  4  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1 
 > pw :0,545

## ITERATION 69 #######################


> Neighbours evaluated; 13
> Selected Move:	7090	3	8	7	19000


> New Y[]: 
	
	 2  0  0  1  3  0  4  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1 
 > pw :0,54

## ITERATION 70 #######################


> Neighbours evaluated; 7
> Selected Move:	7090	4	4	6	19900


> New Y[]: 
	
	 2  0  0  1  4  0  3  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1 
 > pw :0,535

## ITERATION 71 #######################


> Neighbours evaluated; 6
> Selected Move:	7090	4	4	7	19400


> New Y[]: 
	
	 2  0  0  1  1  0  3  4  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1 
 > pw :0,53

## ITERATION 72 #######################


> Neighbours evaluated; 6
> Selected Move:	7090	4	6	4	19500


> New Y[]: 
	
	 2  0  0  1  3  0  1  4  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1 
 > pw :0,525

## ITERATION 73 #######################


> Neighbours evaluated; 6
> Selected Move:	7090	4	4	7	19500


> New Y[]: 
	
	 2  0  0  1  4  0  1  3  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1 
 > pw :0,52

## ITERATION 74 #######################


> Neighbours evaluated; 6
> Selected Move:	7090	4	4	6	18500


> New Y[]: 
	
	 2  0  0  1  1  0  4  3  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1 
 > pw :0,515

## ITERATION 75 #######################


> Neighbours evaluated; 8
> Selected Move:	7168	3	0	8	20800


> New Y[]: 
	
	 0  0  0  1  1  0  4  3  2  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1 
 > pw :0,51

## ITERATION 76 #######################


> Neighbours evaluated; 9
> Selected Move:	7090	3	6	2	19300


> New Y[]: 
	
	 0  0  4  1  1  0  0  3  2  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0 
 > pw :0,505

## ITERATION 77 #######################


> Neighbours evaluated; 20
> Selected Move:	7090	4	7	4	19800


> New Y[]: 
	
	 0  0  4  1  3  0  0  1  2  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0 
 > pw :0,5

## ITERATION 78 #######################


> Neighbours evaluated; 19
> Selected Move:	7090	4	4	8	19100


> New Y[]: 
	
	 0  0  4  1  2  0  0  1  3  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0 
 > pw :0,495

## ITERATION 79 #######################


> Neighbours evaluated; 19
> Selected Move:	7090	4	4	7	18900


> New Y[]: 
	
	 0  0  4  1  1  0  0  2  3  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0 
 > pw :0,49

## ITERATION 80 #######################


> Neighbours evaluated; 19
> Selected Move:	7090	4	8	4	18700


> New Y[]: 
	
	 0  0  4  1  3  0  0  2  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0 
 > pw :0,485

## ITERATION 81 #######################


> Neighbours evaluated; 19
> Selected Move:	7090	4	4	7	18400


> New Y[]: 
	
	 0  0  4  1  2  0  0  3  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0 
 > pw :0,48

## ITERATION 82 #######################


> Neighbours evaluated; 19
> Selected Move:	7090	3	4	6	18400


> New Y[]: 
	
	 0  0  4  1  0  0  2  3  1  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0 
 > pw :0,475

## ITERATION 83 #######################


> Neighbours evaluated; 16
> Selected Move:	7152	3	2	4	20900


> New Y[]: 
	
	 0  0  0  1  4  0  2  3  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1 
 > pw :0,47

## ITERATION 84 #######################


> Neighbours evaluated; 7
> Selected Move:	7063	4	6	7	21100


> New Y[]: 
	
	 0  0  0  1  4  0  3  2  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1 
 > pw :0,465

## ITERATION 85 #######################


> Neighbours evaluated; 7
> Selected Move:	6980	3	8	5	19100


> New Y[]: 
	
	 0  0  0  1  4  1  3  2  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0 
 > pw :0,46

## ITERATION 86 #######################


> Neighbours evaluated; 13
> Selected Move:	6980	4	4	6	18200


> New Y[]: 
	
	 0  0  0  1  3  1  4  2  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0 
 > pw :0,455

## ITERATION 87 #######################


> Neighbours evaluated; 16
> Selected Move:	7080	3	3	8	19700


> New Y[]: 
	
	 0  0  0  0  3  1  4  2  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0 
 > pw :0,45

## ITERATION 88 #######################


> Neighbours evaluated; 7
> Selected Move:	7080	4	4	7	19400


> New Y[]: 
	
	 0  0  0  0  2  1  4  3  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0 
 > pw :0,445

## ITERATION 89 #######################


> Neighbours evaluated; 10
> Selected Move:	7080	4	6	8	19900


> New Y[]: 
	
	 0  0  0  0  2  1  1  3  4  1 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0 
 > pw :0,44

## ITERATION 90 #######################


> Neighbours evaluated; 6
> Selected Move:	7080	4	4	6	19900


> New Y[]: 
	
	 0  0  0  0  1  1  2  3  4  1 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0 
 > pw :0,435

## ITERATION 91 #######################


> Neighbours evaluated; 6
> Selected Move:	7037	4	6	7	20100


> New Y[]: 
	
	 0  0  0  0  1  1  3  2  4  1 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0 
 > pw :0,43

## ITERATION 92 #######################


> Neighbours evaluated; 6
> Selected Move:	7080	4	6	8	19900


> New Y[]: 
	
	 0  0  0  0  1  1  4  2  3  1 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0 
 > pw :0,425

## ITERATION 93 #######################


> Neighbours evaluated; 9
> Selected Move:	6953	4	7	8	20300


> New Y[]: 
	
	 0  0  0  0  1  1  4  3  2  1 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0 
 > pw :0,42

## ITERATION 94 #######################


> Neighbours evaluated; 7
> Selected Move:	6770	3	8	3	20500


> New Y[]: 
	
	 0  0  0  2  1  1  4  3  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0 
 > pw :0,415

## ITERATION 95 #######################


> Neighbours evaluated; 9
> Selected Move:	6980	4	3	4	17900


> New Y[]: 
	
	 0  0  0  1  2  1  4  3  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0 
 > pw :0,41

## ITERATION 96 #######################


> Neighbours evaluated; 15
> Selected Move:	6980	4	4	6	18900


> New Y[]: 
	
	 0  0  0  1  4  1  2  3  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0 
 > pw :0,405

## ITERATION 97 #######################


> Neighbours evaluated; 10
> Selected Move:	6980	4	4	7	18900


> New Y[]: 
	
	 0  0  0  1  3  1  2  4  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0 
 > pw :0,4

## ITERATION 98 #######################


> Neighbours evaluated; 11
> Selected Move:	6980	4	4	6	18800


> New Y[]: 
	
	 0  0  0  1  2  1  3  4  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0 
 > pw :0,395

## ITERATION 99 #######################


> Neighbours evaluated; 12
> Selected Move:	6962	3	3	8	20300


> New Y[]: 
	
	 0  0  0  0  2  1  3  4  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0 
 > pw :0,39

## ITERATION 100 #######################


> Neighbours evaluated; 11
> Selected Move:	6963	4	7	8	20300


> New Y[]: 
	
	 0  0  0  0  2  1  3  1  4  1 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0 
 > pw :0,395

## ITERATION 101 #######################


> Neighbours evaluated; 8
> Selected Move:	6935	3	4	3	20900


> New Y[]: 
	
	 0  0  0  2  0  1  3  1  4  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0 
 > pw :0,4

## ITERATION 102 #######################


> Neighbours evaluated; 10
> Selected Move:	7090	4	6	7	20500


> New Y[]: 
	
	 0  0  0  2  0  1  1  3  4  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0 
 > pw :0,405

## ITERATION 103 #######################


> Neighbours evaluated; 7
> Selected Move:	7088	4	3	7	20500


> New Y[]: 
	
	 0  0  0  3  0  1  1  2  4  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0 
 > pw :0,41

## ITERATION 104 #######################


> Neighbours evaluated; 5
> Selected Move:	7003	4	7	6	20700


> New Y[]: 
	
	 0  0  0  3  0  1  2  1  4  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0 
 > pw :0,415

## ITERATION 105 #######################


> Neighbours evaluated; 6
> Selected Move:	7000	4	8	7	20700


> New Y[]: 
	
	 0  0  0  3  0  1  2  4  1  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0 
 > pw :0,42

## ITERATION 106 #######################


> Neighbours evaluated; 6
> Selected Move:	6912	4	3	6	20900


> New Y[]: 
	
	 0  0  0  2  0  1  3  4  1  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0 
 > pw :0,425

## ITERATION 107 #######################


> Neighbours evaluated; 6
> Selected Move:	6823	4	3	5	21100


> New Y[]: 
	
	 0  0  0  1  0  2  3  4  1  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0 
 > pw :0,43

## ITERATION 108 #######################


> Neighbours evaluated; 8
> Selected Move:	6950	3	5	0	18900


> New Y[]: 
	
	 2  0  0  1  0  0  3  4  1  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0 
 > pw :0,435

## ITERATION 109 #######################


> Neighbours evaluated; 10
> Selected Move:	7030	3	6	4	19000


> New Y[]: 
	
	 2  0  0  1  3  0  0  4  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1 
 > pw :0,44

## ITERATION 110 #######################


> Neighbours evaluated; 8
> Selected Move:	7030	4	4	7	19000


> New Y[]: 
	
	 2  0  0  1  4  0  0  3  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1 
 > pw :0,445

## ITERATION 111 #######################


> Neighbours evaluated; 7
> Selected Move:	7030	4	4	8	18500


> New Y[]: 
	
	 2  0  0  1  1  0  0  3  4  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1 
 > pw :0,45

## ITERATION 112 #######################


> Neighbours evaluated; 7
> Selected Move:	7030	4	7	4	19000


> New Y[]: 
	
	 2  0  0  1  3  0  0  1  4  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1 
 > pw :0,455

## ITERATION 113 #######################


> Neighbours evaluated; 8
> Selected Move:	7030	4	4	8	19700


> New Y[]: 
	
	 2  0  0  1  4  0  0  1  3  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1 
 > pw :0,45

## ITERATION 114 #######################


> Neighbours evaluated; 7
> Selected Move:	7030	4	4	7	19200


> New Y[]: 
	
	 2  0  0  1  1  0  0  4  3  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1 
 > pw :0,445

## ITERATION 115 #######################


> Neighbours evaluated; 7
> Selected Move:	7091	3	0	6	21100


> New Y[]: 
	
	 0  0  0  1  1  0  2  4  3  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1 
 > pw :0,44

## ITERATION 116 #######################


> Neighbours evaluated; 5
> Selected Move:	7096	4	6	4	21100


> New Y[]: 
	
	 0  0  0  1  2  0  1  4  3  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1 
 > pw :0,435

## ITERATION 117 #######################


> Neighbours evaluated; 7
> Selected Move:	6971	4	4	7	21400


> New Y[]: 
	
	 0  0  0  1  4  0  1  2  3  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1 
 > pw :0,43

## ITERATION 118 #######################


> Neighbours evaluated; 7
> Selected Move:	7090	3	4	2	18900


> New Y[]: 
	
	 0  0  4  1  0  0  1  2  3  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0 
 > pw :0,425

## ITERATION 119 #######################


> Neighbours evaluated; 19
> Selected Move:	7090	4	7	6	19100


> New Y[]: 
	
	 0  0  4  1  0  0  2  1  3  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0 
 > pw :0,42

## ITERATION 120 #######################


> Neighbours evaluated; 18
> Selected Move:	7090	4	6	8	19700


> New Y[]: 
	
	 0  0  4  1  0  0  3  1  2  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0 
 > pw :0,415

## ITERATION 121 #######################


> Neighbours evaluated; 14
> Selected Move:	7090	4	6	7	19300


> New Y[]: 
	
	 0  0  4  1  0  0  1  3  2  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0 
 > pw :0,41

## ITERATION 122 #######################


> Neighbours evaluated; 17
> Selected Move:	6967	4	8	9	20300


> New Y[]: 
	
	 0  0  4  1  0  0  1  3  1  2 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0 
 > pw :0,405

## ITERATION 123 #######################


> Neighbours evaluated; 16
> Selected Move:	6969	3	6	4	20300


> New Y[]: 
	
	 0  0  4  1  1  0  0  3  1  2 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0 
 > pw :0,41

## ITERATION 124 #######################


> Neighbours evaluated; 20
> Selected Move:	6842	3	2	6	21800


> New Y[]: 
	
	 0  0  0  1  1  0  4  3  1  2 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1 
 > pw :0,415

## ITERATION 125 #######################


> Neighbours evaluated; 9
> Selected Move:	6980	3	8	5	19800


> New Y[]: 
	
	 0  0  0  1  1  1  4  3  0  2 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0 
 > pw :0,42

## ITERATION 126 #######################


> Neighbours evaluated; 14
> Selected Move:	6980	4	6	9	19900


> New Y[]: 
	
	 0  0  0  1  1  1  2  3  0  4 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0 
 > pw :0,415

## ITERATION 127 #######################


> Neighbours evaluated; 10
> Selected Move:	6980	4	6	4	19900


> New Y[]: 
	
	 0  0  0  1  2  1  1  3  0  4 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0 
 > pw :0,41

## ITERATION 128 #######################


> Neighbours evaluated; 12
> Selected Move:	7167	3	4	8	20300


> New Y[]: 
	
	 0  0  0  1  0  1  1  3  2  4 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0 
 > pw :0,405

## ITERATION 129 #######################


> Neighbours evaluated; 6
> Selected Move:	7047	4	9	3	20600


> New Y[]: 
	
	 0  0  0  4  0  1  1  3  2  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0 
 > pw :0,41

## ITERATION 130 #######################


> Neighbours evaluated; 8
> Selected Move:	6898	3	8	4	20200


> New Y[]: 
	
	 0  0  0  4  2  1  1  3  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0 
 > pw :0,415

## ITERATION 131 #######################


> Neighbours evaluated; 9
> Selected Move:	6897	4	4	6	20200


> New Y[]: 
	
	 0  0  0  4  1  1  2  3  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0 
 > pw :0,42

## ITERATION 132 #######################


> Neighbours evaluated; 8
> Selected Move:	6812	4	6	7	20400


> New Y[]: 
	
	 0  0  0  4  1  1  3  2  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0 
 > pw :0,425

## ITERATION 133 #######################


> Neighbours evaluated; 7
> Selected Move:	6938	4	3	9	20100


> New Y[]: 
	
	 0  0  0  1  1  1  3  2  0  4 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0 
 > pw :0,43

## ITERATION 134 #######################


> Neighbours evaluated; 11
> Selected Move:	6894	4	6	4	20200


> New Y[]: 
	
	 0  0  0  1  3  1  1  2  0  4 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0 
 > pw :0,435

## ITERATION 135 #######################


> Neighbours evaluated; 13
> Selected Move:	6806	4	7	6	20400


> New Y[]: 
	
	 0  0  0  1  3  1  2  1  0  4 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0 
 > pw :0,44

## ITERATION 136 #######################


> Neighbours evaluated; 11
> Selected Move:	6848	4	4	6	20300


> New Y[]: 
	
	 0  0  0  1  2  1  3  1  0  4 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0 
 > pw :0,445

## ITERATION 137 #######################


> Neighbours evaluated; 13
> Selected Move:	6979	3	4	8	20700


> New Y[]: 
	
	 0  0  0  1  0  1  3  1  2  4 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0 
 > pw :0,45

## ITERATION 138 #######################


> Neighbours evaluated; 8
> Selected Move:	6885	4	6	9	20900


> New Y[]: 
	
	 0  0  0  1  0  1  4  1  2  3 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0 
 > pw :0,455

## ITERATION 139 #######################


> Neighbours evaluated; 10
> Selected Move:	6790	4	9	3	21100


> New Y[]: 
	
	 0  0  0  3  0  1  4  1  2  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0 
 > pw :0,46

## ITERATION 140 #######################


> Neighbours evaluated; 7
> Selected Move:	6830	4	3	6	21000


> New Y[]: 
	
	 0  0  0  4  0  1  3  1  2  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0 
 > pw :0,465

## ITERATION 141 #######################


> Neighbours evaluated; 11
> Selected Move:	6701	3	8	4	20600


> New Y[]: 
	
	 0  0  0  4  2  1  3  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0 
 > pw :0,47

## ITERATION 142 #######################


> Neighbours evaluated; 11
> Selected Move:	6651	4	3	6	20700


> New Y[]: 
	
	 0  0  0  3  2  1  4  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0 
 > pw :0,475

## ITERATION 143 #######################


> Neighbours evaluated; 9
> Selected Move:	6742	4	3	9	20500


> New Y[]: 
	
	 0  0  0  1  2  1  4  1  0  3 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0 
 > pw :0,48

## ITERATION 144 #######################


> Neighbours evaluated; 10
> Selected Move:	6836	4	4	7	20300


> New Y[]: 
	
	 0  0  0  1  1  1  4  2  0  3 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0 
 > pw :0,485

## ITERATION 145 #######################


> Neighbours evaluated; 9
> Selected Move:	6870	3	9	8	19900


> New Y[]: 
	
	 0  0  0  1  1  1  4  2  3  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0 
 > pw :0,49

## ITERATION 146 #######################


> Neighbours evaluated; 13
> Selected Move:	6870	4	8	4	19700


> New Y[]: 
	
	 0  0  0  1  3  1  4  2  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0 
 > pw :0,495

## ITERATION 147 #######################


> Neighbours evaluated; 14
> Selected Move:	6870	4	4	7	19400


> New Y[]: 
	
	 0  0  0  1  2  1  4  3  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0 
 > pw :0,5

## ITERATION 148 #######################


> Neighbours evaluated; 12
> Selected Move:	6870	4	6	8	19900


> New Y[]: 
	
	 0  0  0  1  2  1  1  3  4  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0 
 > pw :0,505

## ITERATION 149 #######################


> Neighbours evaluated; 10
> Selected Move:	6870	4	4	6	19900


> New Y[]: 
	
	 0  0  0  1  1  1  2  3  4  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0 
 > pw :0,51

## ITERATION 150 #######################


> Neighbours evaluated; 14
> Selected Move:	6819	4	6	7	20100


> New Y[]: 
	
	 0  0  0  1  1  1  3  2  4  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0 
 > pw :0,515

## ITERATION 151 #######################


> Neighbours evaluated; 8
> Selected Move:	6767	4	6	4	20200


> New Y[]: 
	
	 0  0  0  1  3  1  1  2  4  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0 
 > pw :0,52

## ITERATION 152 #######################


> Neighbours evaluated; 9
> Selected Move:	6976	3	3	9	20200


> New Y[]: 
	
	 0  0  0  0  3  1  1  2  4  1 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0 
 > pw :0,525

## ITERATION 153 #######################


> Neighbours evaluated; 5
> Selected Move:	6870	4	7	6	20400


> New Y[]: 
	
	 0  0  0  0  3  1  2  1  4  1 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0 
 > pw :0,53

## ITERATION 154 #######################


> Neighbours evaluated; 9
> Selected Move:	6868	4	8	7	20400


> New Y[]: 
	
	 0  0  0  0  3  1  2  4  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0 
 > pw :0,535

## ITERATION 155 #######################


> Neighbours evaluated; 6
> Selected Move:	6866	4	4	7	20400


> New Y[]: 
	
	 0  0  0  0  4  1  2  3  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0 
 > pw :0,54

## ITERATION 156 #######################


> Neighbours evaluated; 6
> Selected Move:	6756	4	6	7	20600


> New Y[]: 
	
	 0  0  0  0  4  1  3  2  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0 
 > pw :0,545

## ITERATION 157 #######################


> Neighbours evaluated; 8
> Selected Move:	6589	4	6	8	20900


> New Y[]: 
	
	 0  0  0  0  4  1  1  2  3  1 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0 
 > pw :0,55

## ITERATION 158 #######################


> Neighbours evaluated; 6
> Selected Move:	6750	4	4	7	20600


> New Y[]: 
	
	 0  0  0  0  2  1  1  4  3  1 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0 
 > pw :0,555

## ITERATION 159 #######################


> Neighbours evaluated; 6
> Selected Move:	6747	4	4	6	20600


> New Y[]: 
	
	 0  0  0  0  1  1  2  4  3  1 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0 
 > pw :0,56

## ITERATION 160 #######################


> Neighbours evaluated; 11
> Selected Move:	6540	2	5	-1	16600


> New Y[]: 
	
	 0  0  0  0  1  0  2  4  3  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0 
 > pw :0,565

## ITERATION 161 #######################


> Neighbours evaluated; 15
> Selected Move:	6680	3	4	3	14600


> New Y[]: 
	
	 0  0  0  1  0  0  2  4  3  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0 
 > pw :0,57

## ITERATION 162 #######################


> Neighbours evaluated; 19
> Selected Move:	6680	4	6	3	17200


> New Y[]: 
	
	 0  0  0  2  0  0  1  4  3  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0 
 > pw :0,575

## ITERATION 163 #######################


> Neighbours evaluated; 19
> Selected Move:	6680	4	3	7	16200


> New Y[]: 
	
	 0  0  0  4  0  0  1  2  3  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0 
 > pw :0,58

## ITERATION 164 #######################


> Neighbours evaluated; 17
> Selected Move:	6680	4	3	6	13900


> New Y[]: 
	
	 0  0  0  1  0  0  4  2  3  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0 
 > pw :0,585

## ITERATION 165 #######################


> Neighbours evaluated; 17
> Selected Move:	6680	4	6	8	14100


> New Y[]: 
	
	 0  0  0  1  0  0  3  2  4  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0 
 > pw :0,58

## ITERATION 166 #######################


> Neighbours evaluated; 18
> Selected Move:	6680	4	6	3	16500


> New Y[]: 
	
	 0  0  0  3  0  0  1  2  4  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0 
 > pw :0,575

## ITERATION 167 #######################


> Neighbours evaluated; 16
> Selected Move:	6680	4	3	7	16500


> New Y[]: 
	
	 0  0  0  2  0  0  1  3  4  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0 
 > pw :0,57

## ITERATION 168 #######################


> Neighbours evaluated; 16
> Selected Move:	6680	4	3	6	13900


> New Y[]: 
	
	 0  0  0  1  0  0  2  3  4  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0 
 > pw :0,565

## ITERATION 169 #######################


> Neighbours evaluated; 15
> Selected Move:	6680	4	6	8	14300


> New Y[]: 
	
	 0  0  0  1  0  0  4  3  2  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0 
 > pw :0,56

## ITERATION 170 #######################


> Neighbours evaluated; 16
> Selected Move:	6680	4	6	3	16600


> New Y[]: 
	
	 0  0  0  4  0  0  1  3  2  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0 
 > pw :0,555

## ITERATION 171 #######################


> Neighbours evaluated; 14
> Selected Move:	6680	4	3	7	17600


> New Y[]: 
	
	 0  0  0  3  0  0  1  4  2  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0 
 > pw :0,55

## ITERATION 172 #######################


> Neighbours evaluated; 14
> Selected Move:	6680	4	3	6	15200


> New Y[]: 
	
	 0  0  0  1  0  0  3  4  2  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0 
 > pw :0,545

## ITERATION 173 #######################


> Neighbours evaluated; 13
> Selected Move:	6680	4	6	9	17400


> New Y[]: 
	
	 0  0  0  1  0  0  1  4  2  3 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0 
 > pw :0,54

## ITERATION 174 #######################


> Neighbours evaluated; 19
> Selected Move:	6680	4	7	3	19200


> New Y[]: 
	
	 0  0  0  4  0  0  1  1  2  3 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0 
 > pw :0,535

## ITERATION 175 #######################


> Neighbours evaluated; 17
> Selected Move:	6680	4	3	6	16900


> New Y[]: 
	
	 0  0  0  1  0  0  4  1  2  3 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0 
 > pw :0,53

## ITERATION 176 #######################


> Neighbours evaluated; 17
> Selected Move:	6680	4	6	8	16500


> New Y[]: 
	
	 0  0  0  1  0  0  2  1  4  3 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0 
 > pw :0,525

## ITERATION 177 #######################


> Neighbours evaluated; 17
> Selected Move:	6680	4	6	3	19100


> New Y[]: 
	
	 0  0  0  2  0  0  1  1  4  3 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0 
 > pw :0,52

## ITERATION 178 #######################


> Neighbours evaluated; 16
> Selected Move:	6680	4	3	7	16300


> New Y[]: 
	
	 0  0  0  1  0  0  1  2  4  3 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0 
 > pw :0,515

## ITERATION 179 #######################


> Neighbours evaluated; 14
> Selected Move:	6680	4	7	9	15800


> New Y[]: 
	
	 0  0  0  1  0  0  1  3  4  2 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0 
 > pw :0,51

## ITERATION 180 #######################


> Neighbours evaluated; 16
> Selected Move:	6680	4	7	3	18600


> New Y[]: 
	
	 0  0  0  3  0  0  1  1  4  2 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0 
 > pw :0,505

## ITERATION 181 #######################


> Neighbours evaluated; 15
> Selected Move:	6680	4	3	6	16200


> New Y[]: 
	
	 0  0  0  1  0  0  3  1  4  2 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0 
 > pw :0,5

## ITERATION 182 #######################


> Neighbours evaluated; 15
> Selected Move:	6680	4	6	8	16000


> New Y[]: 
	
	 0  0  0  1  0  0  4  1  3  2 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0 
 > pw :0,495

## ITERATION 183 #######################


> Neighbours evaluated; 15
> Selected Move:	6680	4	6	3	18300


> New Y[]: 
	
	 0  0  0  4  0  0  1  1  3  2 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0 
 > pw :0,49

## ITERATION 184 #######################


> Neighbours evaluated; 13
> Selected Move:	6680	4	3	7	16500


> New Y[]: 
	
	 0  0  0  1  0  0  1  4  3  2 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0 
 > pw :0,485

## ITERATION 185 #######################


> Neighbours evaluated; 12
> Selected Move:	6680	4	7	9	15900


> New Y[]: 
	
	 0  0  0  1  0  0  1  2  3  4 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0 
 > pw :0,48

## ITERATION 186 #######################


> Neighbours evaluated; 14
> Selected Move:	6680	4	7	3	18700


> New Y[]: 
	
	 0  0  0  2  0  0  1  1  3  4 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0 
 > pw :0,475

## ITERATION 187 #######################


> Neighbours evaluated; 14
> Selected Move:	6680	4	3	6	16100


> New Y[]: 
	
	 0  0  0  1  0  0  2  1  3  4 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0 
 > pw :0,47

## ITERATION 188 #######################


> Neighbours evaluated; 13
> Selected Move:	6680	4	6	8	16700


> New Y[]: 
	
	 0  0  0  1  0  0  3  1  2  4 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0 
 > pw :0,465

## ITERATION 189 #######################


> Neighbours evaluated; 13
> Selected Move:	6680	4	6	3	19100


> New Y[]: 
	
	 0  0  0  3  0  0  1  1  2  4 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0 
 > pw :0,46

## ITERATION 190 #######################


> Neighbours evaluated; 11
> Selected Move:	6680	4	3	7	16300


> New Y[]: 
	
	 0  0  0  1  0  0  1  3  2  4 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0 
 > pw :0,455

## ITERATION 191 #######################


> Neighbours evaluated; 10
> Selected Move:	6680	4	8	3	18000


> New Y[]: 
	
	 0  0  0  2  0  0  1  3  1  4 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0 
 > pw :0,45

## ITERATION 192 #######################


> Neighbours evaluated; 17
> Selected Move:	6680	4	3	6	15400


> New Y[]: 
	
	 0  0  0  1  0  0  2  3  1  4 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0 
 > pw :0,445

## ITERATION 193 #######################


> Neighbours evaluated; 17
> Selected Move:	6735	1	-1	4	21900


> New Y[]: 
	
	 0  0  0  1  1  0  2  3  1  4 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1 
 > pw :0,44

## ITERATION 194 #######################


> Neighbours evaluated; 5
> Selected Move:	7030	3	6	0	20000


> New Y[]: 
	
	 2  0  0  1  1  0  0  3  1  4 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1 
 > pw :0,435

## ITERATION 195 #######################


> Neighbours evaluated; 8
> Selected Move:	6950	3	4	6	20000


> New Y[]: 
	
	 2  0  0  1  0  0  1  3  1  4 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0 
 > pw :0,43

## ITERATION 196 #######################


> Neighbours evaluated; 7
> Selected Move:	6950	4	9	6	18000


> New Y[]: 
	
	 2  0  0  1  0  0  4  3  1  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0 
 > pw :0,425

## ITERATION 197 #######################


> Neighbours evaluated; 9
> Selected Move:	6950	4	6	8	18500


> New Y[]: 
	
	 2  0  0  1  0  0  1  3  4  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0 
 > pw :0,42

## ITERATION 198 #######################


> Neighbours evaluated; 7
> Selected Move:	6996	3	0	5	20700


> New Y[]: 
	
	 0  0  0  1  0  2  1  3  4  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0 
 > pw :0,415

## ITERATION 199 #######################


> Neighbours evaluated; 10
> Selected Move:	6834	4	5	8	21100


> New Y[]: 
	
	 0  0  0  1  0  4  1  3  2  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0 
 > pw :0,41

## ITERATION 200 #######################


> Neighbours evaluated; 7
> Selected Move:	7003	4	7	8	20700


> New Y[]: 
	
	 0  0  0  1  0  4  1  2  3  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0 
 > pw :0,405

## ITERATION 201 #######################


> Neighbours evaluated; 7
> Selected Move:	6926	4	7	6	20900


> New Y[]: 
	
	 0  0  0  1  0  4  2  1  3  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0 
 > pw :0,41

## ITERATION 202 #######################


> Neighbours evaluated; 9
> Selected Move:	6924	3	5	4	21600


> New Y[]: 
	
	 0  0  0  1  4  0  2  1  3  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1 
 > pw :0,415

## ITERATION 203 #######################


> Neighbours evaluated; 8
> Selected Move:	6750	3	8	1	19900


> New Y[]: 
	
	 0  3  0  1  4  0  2  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0 
 > pw :0,42

## ITERATION 204 #######################


> Neighbours evaluated; 19
> Selected Move:	6832	3	9	8	21400


> New Y[]: 
	
	 0  3  0  1  4  0  2  1  1  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0 
 > pw :0,425

## ITERATION 205 #######################


> Neighbours evaluated; 12
> Selected Move:	7040	3	4	9	20400


> New Y[]: 
	
	 0  3  0  1  0  0  2  1  1  4 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0 
 > pw :0,43

## ITERATION 206 #######################


> Neighbours evaluated; 9
> Selected Move:	7124	4	6	7	20200


> New Y[]: 
	
	 0  3  0  1  0  0  1  2  1  4 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0 
 > pw :0,435

## ITERATION 207 #######################


> Neighbours evaluated; 16
> Selected Move:	6993	4	9	3	20500


> New Y[]: 
	
	 0  3  0  4  0  0  1  2  1  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0 
 > pw :0,44

## ITERATION 208 #######################


> Neighbours evaluated; 17
> Selected Move:	6902	4	7	6	20700


> New Y[]: 
	
	 0  3  0  4  0  0  2  1  1  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0 
 > pw :0,445

## ITERATION 209 #######################


> Neighbours evaluated; 18
> Selected Move:	6765	4	3	6	21000


> New Y[]: 
	
	 0  3  0  2  0  0  4  1  1  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0 
 > pw :0,45

## ITERATION 210 #######################


> Neighbours evaluated; 11
> Selected Move:	6930	3	3	4	20400


> New Y[]: 
	
	 0  3  0  0  2  0  4  1  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0 
 > pw :0,455

## ITERATION 211 #######################


> Neighbours evaluated; 10
> Selected Move:	7019	4	4	7	20200


> New Y[]: 
	
	 0  3  0  0  1  0  4  2  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0 
 > pw :0,46

## ITERATION 212 #######################


> Neighbours evaluated; 13
> Selected Move:	6788	4	6	8	20700


> New Y[]: 
	
	 0  3  0  0  1  0  1  2  4  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  1  0 
 > pw :0,465

## ITERATION 213 #######################


> Neighbours evaluated; 10
> Selected Move:	7094	3	9	3	20700


> New Y[]: 
	
	 0  3  0  1  1  0  1  2  4  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0 
 > pw :0,47

## ITERATION 214 #######################


> Neighbours evaluated; 10
> Selected Move:	6997	4	7	4	20900


> New Y[]: 
	
	 0  3  0  1  2  0  1  1  4  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0 
 > pw :0,475

## ITERATION 215 #######################


> Neighbours evaluated; 10
> Selected Move:	6992	4	4	6	20900


> New Y[]: 
	
	 0  3  0  1  1  0  2  1  4  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0 
 > pw :0,48

## ITERATION 216 #######################


> Neighbours evaluated; 12
> Selected Move:	6988	4	8	7	20900


> New Y[]: 
	
	 0  3  0  1  1  0  2  4  1  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0 
 > pw :0,485

## ITERATION 217 #######################


> Neighbours evaluated; 10
> Selected Move:	6984	4	6	4	20900


> New Y[]: 
	
	 0  3  0  1  2  0  1  4  1  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0 
 > pw :0,49
________________________________________________________________

Best solution found: 7580
Run Termination time: 31.01.2010 10:25:07
Run duration: 00:00:20.5156250
________________________________________________________________
